Reachable Markings of Object Petri Nets
نویسنده
چکیده
In this article I will prove undecidability results for elementary object net systems (Eos). Object nets are Petri nets which have Petri nets as tokens – an approach which is called the “nets-within-nets” paradigm. Eos are special object net system which have a two leveled structure.
منابع مشابه
Petri Nets with Time Windows: Possibilities and Limitations
In this paper we present a time extension of Petri nets called Petri net with Time Windows (short: tw-PN) where time intervals (windows) are associated with the places. We give a formal definition for this class and compare these time dependent Petri nets with their (timeless) skeletons. In particular, we compare their sets of reachable markings and their liveness behaviour. The sets of reachab...
متن کاملSymbolic Petri Net Analysis Using Boolean Manipulation
This work presents an ennumerative analysis approach for bounded Petri nets. The structure and behavior of the petri net are symbolically modeled by using boolean functions; thus, reducing reasoning about Petri nets to boolean calculation. The set of reachable markings is enumerated by symbolically ring the transitions in the Petri net. Highly concurrent Petri nets may suuer from the state expl...
متن کاملSymbolic Analysis of Bounded Petri Nets
ÐThis work presents a symbolic approach for the analysis of bounded Petri nets. The structure and behavior of the Petri net is symbolically modeled by using Boolean functions, thus reducing reasoning about Petri nets to Boolean calculation. The set of reachable markings is calculated by symbolically firing the transitions in the Petri net. Highly concurrent systems suffer from the state explosi...
متن کاملReversible Computation vs. Reversibility in Petri Nets
Petri nets are a general formal model of concurrent systems which supports both action-based and state-based modelling and reasoning. One of important behavioural properties investigated in the context of Petri nets has been reversibility, understood as the possibility of returning to the initial marking from any reachable net marking. Thus reversibility in Petri nets is a global property. Reve...
متن کاملMarkings in Perpetual Free-Choice Nets Are Fully Characterized by Their Enabled Transitions
A marked Petri net is lucent if there are no two different reachable markings enabling the same set of transitions, i.e., states are fully characterized by the transitions they enable. This paper explores the class of marked Petri nets that are lucent and proves that perpetual marked free-choice nets are lucent. Perpetual free-choice nets are free-choice Petri nets that are live and bounded and...
متن کامل